Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
971	Journal of Machine Learning Research[removed] Submitted 10/02; Published 6/03 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2004-04-06 06:38:40 Complexity classes P versus NP problem Probably approximately correct learning PP NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
972	Data Anonymization Generalization Algorithms Li Xiong, Slawek Goryczka CS573 Data Privacy and Anonymity Add to Reading List Source URL: www.mathcs.emory.edu Language: English - Date: 2012-02-01 16:27:22 Computing Data management Operations research NP Mathematical optimization Attrib Tuple Pruning Complexity classes Mathematics Applied mathematics
973	Information and Computation[removed]–55 www.elsevier.com/locate/ic Add to Reading List Source URL: www.math.nus.edu.sg Language: English - Date: 2003-07-25 20:48:35 Complexity classes Structural complexity theory Closest string String Formal languages NP Substring Hamming distance P versus NP problem Theoretical computer science Mathematics Applied mathematics
974	How to Generate and Exchange Secrets (extended abstract) Add to Reading List Source URL: www.csee.wvu.edu Language: English - Date: 2009-04-08 11:29:01 Complexity classes Probabilistic complexity theory Analysis of algorithms PP Quantum complexity theory Bounded-error probabilistic polynomial Randomized algorithm IP NP Theoretical computer science Computational complexity theory Applied mathematics
975	THE P VERSUS NP PROBLEM STEPHEN COOK Add to Reading List Source URL: www.claymath.org Language: English - Date: 2013-08-12 10:39:14 Complexity classes NP-hard P versus NP problem NP P Bounded-error probabilistic polynomial Oracle machine Reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
976	Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning Nader H. Bshouty∗ ([removed]) Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2004-05-06 04:06:20 Complexity classes Approximation algorithm Time complexity ZPP NP Theoretical computer science Computational complexity theory Applied mathematics
977	A Brief History of NP-Completeness, 1954–2012 David S. Johnson Mathematics subject classification: 68-03, 68Q17, 68Q25, 68W25, 90C05, 90C22 Add to Reading List Source URL: www.research.att.com Language: English - Date: 2012-09-06 18:30:18 Complexity classes NP-complete Cook–Levin theorem P versus NP problem NP-hard NP Stephen Cook Clique problem P Theoretical computer science Computational complexity theory Applied mathematics
978	: 1 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-03-17 11:51:03 Applied mathematics Complexity classes Automata theory Models of computation Linear bounded automaton Context-sensitive language Context-sensitive grammar Regular language SL Theoretical computer science Formal languages Computational complexity theory
979	ICM 2002 • Vol. I • 245^272 Mathematical Foundations of Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:56:38 Complexity classes Pseudorandomness Analysis of algorithms Probabilistic complexity theory One-way function Hard-core predicate NP P versus NP problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
980	Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2013-04-24 07:33:09 Complexity classes Probabilistic complexity theory Mathematical optimization NP-complete problems Probabilistically checkable proof NP PCP theorem P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics

UPDATE